Comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs
نویسندگان
چکیده
In this paper, we obtain a comparison of Steklov eigenvalues and Laplacian on graphs discuss its rigidity. As applications the eigenvalues, Lichnerowicz-type estimates some combinatorial for graphs.
منابع مشابه
Bounds on normalized Laplacian eigenvalues of graphs
*Correspondence: [email protected] 1School of Mathematics and Statistics, Minnan Normal University, Zhangzhou, Fujian, P.R. China 2Center for Discrete Mathematics, Fuzhou University, Fuzhou, Fujian, P.R. China Full list of author information is available at the end of the article Abstract Let G be a simple connected graph of order n, where n≥ 2. Its normalized Laplacian eigenvalues are 0 = λ1 ...
متن کاملSome remarks on Laplacian eigenvalues and Laplacian energy of graphs
Suppose μ1, μ2, ... , μn are Laplacian eigenvalues of a graph G. The Laplacian energy of G is defined as LE(G) = ∑n i=1 |μi − 2m/n|. In this paper, some new bounds for the Laplacian eigenvalues and Laplacian energy of some special types of the subgraphs of Kn are presented. AMS subject classifications: 05C50
متن کاملTwo-Parameter Eigenvalues Steklov Problem involving the p-Laplacian
We study the existence of eigenvalues for a two parameter Steklov eigenvalues problem with weights. Moreover, we prove the simplicity and the isolation results of the principal eigenvalue. Finally, we obtain the continuity and the differentiability of this principal eigenvalue. AMS Subject Classifications: 35J60, 35B33.
متن کاملSignless Laplacian eigenvalues and circumference of graphs
In this paper, we investigate the relation between the Q -spectrum and the structure of G in terms of the circumference of G. Exploiting this relation, we give a novel necessary condition for a graph to be Hamiltonian by means of its Q -spectrum. We also determine the graphs with exactly one or two Q -eigenvalues greater than or equal to 2 and obtain all minimal forbidden subgraphs and maximal ...
متن کاملOn the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2022
ISSN: ['2330-1511']
DOI: https://doi.org/10.1090/proc/15866